Thick inductive cross shaped metal meshes

Generating Well-Shaped d-dimensional Delaunay Meshes

Generating Well-Shaped Delaunay Meshes in 3D

A triangular mesh in 3D is a decomposition of a given geometric domain into tetrahedra. The mesh is wellshaped if the aspect ratio of every of its tetrahedra is bounded from above by a constant. It is Delaunay if the interior of the circum-sphere of each of its tetrahedra does not contain any other mesh vertices. Generating a well-shaped Delaunay mesh for any 3D domain has been a long term outs...

Abundances of metal - weak thick - disc candidates

High resolution spectra of 5 candidate metal-weak thick-disc stars suggested by Beers & Sommer-Larsen (1995) are analyzed to determine their chemical abundances. The low abundance of all the objects has been confirmed with metallicity reaching [Fe/H]= −2.9. However, for three objects, the astrometric data from the Hipparcos catalogue suggests they are true halo members. The remaining two, for w...

Faster Fiedler Vector Computation for Laplacians of Well - Shaped Meshes

We present a faster method for finding the Fiedler vector of the Laplacian of a mesh. This problem is the main computational cost of spectral partitioning, a technique for partitioning a graph into pieces of roughly equal size with few crossing edges, which has applications to load balancing on parallel machines. Our experiments show an improvement of 15 to 40 percent in the speed of the standa...

Point Location in Well-Shaped Meshes Using Jump-and-Walk

We present results on executing point location queries in well-shaped meshes in R and R using the Jumpand-Walk paradigm. If the jump step is performed on a nearest-neighbour search structure built on the vertices of the mesh, we demonstrate that the walk step can be performed in guaranteed constant time. Constant time for the walk step holds even if the jump step starts with an approximate near...